Optimal randomized incremental construction for guaranteed logarithmic planar point location
نویسندگان
چکیده
منابع مشابه
Optimal randomized incremental construction for guaranteed logarithmic planar point location
Given a planar map of n segments in which we wish to efficiently locate points, we present the first randomized incremental construction of the well-known trapezoidal-map search-structure that only requires expected O(n logn) preprocessing time while deterministically guaranteeing worst-case linear storage space and worst-case logarithmic query time. This settles a long standing open problem; t...
متن کاملOptimal Logarithmic Time Randomized Suffix Tree Construction
The suffix tree of a string, the fundamental data structure in the area of combinatorial pattern matching, has many elegant applications. In this paper, we present a novel, simple sequential algorithm for the construction of suffix trees. We are also able to parallelize our algorithm so that we settle the main open problem in the construction of suffix trees: we give a Las Vegas CRCW PRAM algor...
متن کاملDynamic Planar Point Location with Sub-logarithmic Local Updates
4 We study planar point location in a collection of disjoint fat regions, and investigate the complexity of local 5 updates: replacing any region by a different region that is “similar” to the original region. (i.e., the size 6 differs by at most a constant factor, and distance between the two regions is a constant times that size). 7 We show that it is possible to create a linear size data str...
متن کاملOptimal Expected-Case Planar Point Location
Point location is the problem of preprocessing a planar polygonal subdivision S of size n into a data structure in order to determine efficiently the cell of the subdivision that contains a given query point. We consider this problem from the perspective of expected query time. We are given the probabilities pz that the query point lies within each cell z ∈ S. The entropy H of the resulting dis...
متن کاملNearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision the probability that a query point lies within this polygon. The goal is to compute a search structure to determine which cell of the subdivision contains a given query point, so as to minimize the expected search time....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2016
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2016.07.006